On the Workload Allocation Problem of Short Unreliable Production Lines with Finite Buffers
نویسندگان
چکیده
Serial flow or production lines are modeled as tandem queueing networks and formulated as continuous-time Markov chains to investigate how to maximize throughput or minimize the average work-in-process (WIP) when the total service time among the stations are fixed (this is the workload allocation problem). This paper examines the effect of the unreliability of the machines on the optimal workload allocation in order to maximize throughput or minimize the average WIP subject to a minimum required throughput.
منابع مشابه
Adaptive policy of buffer allocation and preventive maintenance actions in unreliable production lines
The buffer allocation problem is an NP-hard combinatorial optimization problem, and it is an important design problem in manufacturing systems. The research proposed in this paper concerns a product line consisting of n unreliable machines with n − 1 buffers and a preventive maintenance policy. The focus of the research is to obtain a better trade-off between the buffer level ...
متن کاملVacation model for Markov machine repair problem with two heterogeneous unreliable servers and threshold recovery
Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back to render repair job when the pre-specified workload of failed machines is build up. The first (seco...
متن کاملAnt colonies for performance optimization of multi-components systems subject to random failures
Reliability has been considered as an important design measure in industry. The design of a system involves in general numerous discrete choices among available component types based on reliability, cost, performance, weight, etc. If the design objective is to maximize reliability for a certain cost requirement, then a strategy is required to identify the optimal combination of components and/o...
متن کاملStochastic Algorithms for Buffer allocation in Reliable Production Lines
The allocation of buffers between workstations is a major optimization problem faced by manufacturing systems designers. It entails the determination of optimal buffer allocation plans in production lines with the objective of maximizing their throughput. We present and compare two stochastic approaches for solving the buffer allocation problem in large reliable production lines. The allocation...
متن کاملCycle Time Reduction and Runtime Rebalancing by Reallocating Dependent Tasks
Business Process Management Systems (BPMS) is a complex information system that provides designing, administrating, and improving the business processes. Task allocation to human resources is one of the most important issues which should be managed more efficiently in BPMS. Task allocation algorithms are defined in order to meet the various policies of organizations. The most important of these...
متن کامل